Unification of Disjunctive Feature Descriptions
نویسندگان
چکیده
The paper describes a new implementation of feature structures containing disjunctive values, which can be characterized by the following main points: Local representation of embedded disjunctions, avoidance of expansion to disjunctive normal form and of repeated test-unifications for checking consistence. The method is based on a modification of Kasper and Rounds' calculus of feature descriptions and its correctness therefore is easy to see. It can handle cyclic structures and has been incorporated successfully into an environment for grammar development.
منابع مشابه
Constraint Projection: An Efficient Treatment of Disjunctive Feature Descriptions
Unification of disjunctive feature descriptions is important for efficient unification-based parsing. This paper presents constraint projection, a new method for unification of disjunctive feature structures represented by logical constraints. Constraint projection is a generalization of constraint unification, and is more efficient because constraint projection has a mechanism for abandoning i...
متن کاملA Unification Method for Disjunctive Feature Descriptions
Although disjunction has been used in several unificationbased grammar formalisms, existing methods of unification have been unsatisfactory for descriptions containing large quantities of disjunction, because they require exponential time. This paper describes a method of unification by successive approximation, resulting in better average performance. 1 I n t r o d u c t i o n Disjunction has ...
متن کاملDisjunctive Unification
This paper describes techniques for the representation and efficient unification of feature structures in the presence of disjunctive information. For the specification of feature structures we introduce feature terms which may contain sorts, variables, negation and named disjunction. Disjunction names allow for a compact representation and efficient management of multiple solutions even in cas...
متن کاملDisjunctive Feature Structures As Hypergraphs
A b s t r a c t -In this paper, we present a new mathematical framework in which disjunctive feature structures are defined as directed acyclic hypergraphs. Disjunction is defined in the feature structure domain, and not at the syntactic level in feature descriptions. This enables us to study properties and specify operations in terms of properties of, or operations on, hypergraphs rather titan...
متن کاملA Treatment Of Negative Descriptions Of Typed Feature Structures
A formal treatment of typed feature structures (TFSs) is developed to augment TFSs, so that negative descriptions of them can be treated. Negative descriptions of TFSs can make linguistic descriptions compact and thus easy to understand. Negative descriptions can be classified into three primitive negative descriptions: (1) negations of type symbols, (2) negations of feature existences, and (3)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988